Axiomatic system for phrase structure grammars. I
نویسندگان
چکیده
منابع مشابه
Practical Parsing of Generalized Phrase Structure Grammars
An efficient algorithm is described for parsing a dialect of generalized phrase structure grammar (GPSG). A practical parsing system, based on the algorithm, is presented. The dialect of GPSG which the parsing system accepts is smaller, but considerably "purer" (closer to the original definition of GPSG) and mathematically "cleaner" than that which is accepted by other practical parsing systems...
متن کاملPhrase Structure Grammars and Natural Languages
D u r i n g most o f t he l a s t two decades , c o m p u t a t i o n a l l i n g u i s t s and A I r e s e a r c h e r s w o r k i n g o n n a t u r a l language have assumed t h a t phrase s t r u c t u r e grammars, d e s p i t e t h e i r c o m p u t a t i o n a l t r a c t a b i l i t y , were u n s a t i s f a c t o r y d e v i c e s f o r e x p r e s s i n g the s y n t a x o f n a t u r...
متن کاملDiscontinuity and Asymmetry in Phrase Structure Grammars
C h o m s k y (1959)1 defines a class of g r a m m a r s each of which conta ins a f ini te n u m b e r of rules of the fo rm x1Ax= --~ xicox2, where A is a single symbo l and co ~ I . Such g r a m m a r s are cal led contex t sens i t ive ph rase s t ruc tu re (CS) g r ammars . Contex t f ree ph rase s t ruc tu re ( C F ) g r a m m a r s are a subclass of CS g r a m m a r s all of whose rules ...
متن کاملPractical parsing of generalised phrase structure grammars
An efficient algorithm is described for parsing a dialect of generalised phrase structure grammar (GPSG). A practical parsing system, based on the algorithm, is presented. The dialect of GPSG which the parsing system accepts is smaller, but considerably "purer" (closer to the original definition of GPSG) and mathematically "cleaner" than that which is accepted by other practical parsing systems...
متن کاملFinite-State Approximation of Phrase Structure Grammars
Phrase-structure grammars are effective models for important syntactic and semantic aspects of natural languages, but can be computationally too demanding for use as language models in real-time speech recognition. Therefore, finite-state models are used instead, even though they lack expressive power. To reconcile those two alternatives, we designed an algorithm to compute finite-state approxi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1965
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(65)90386-4